Projective planes and congestion-free networks

| The design of networks using broadcast media so that every two sites lie on a common link, subject to constraints on the number of links at each site (degree), and the number of sites on each link (link size), is examined. A method proposed by Yener, Ofek, and Yung is shown to fail in general to achieve the minimum link size for a speciied degree constraint. The existence of (k; n)-arcs in projective planes is employed to improve upon their results.